Secure and Compressed Secret Writing using DES and DEFLATE algorithm

A new secret writing using DES and DEFLATE algorithm is explored by improving the previous attempts in this sense in terms of security and compression. A Matching Pursuit algorithm using redundant basis decomposition technique is used to securely hide a message. The stability and computational complexity problems are solved by introducing new selection and update rules working entirely in the integer domain. Image decomposition is randomized in several ways thus improving the stego-message undetectability, and making the hidden message undetectable by targeted steganalyzers. A refinement decomposition step is applied to the three color bands to increase the stego-message payload. Due to the ever-increasing security threats, there is a need to develop algorithms with more complexity and advanced features for a secured message transfer. A comparative study is performed between LempelZiv-Welch (LZW) data compression algorithm and deflate lossless compression algorithm which proves the efficiency of deflate algorithm in both rate of compression and its compression speed.